منابع مشابه
A Semi - supervised Text Clustering Algorithm Based on Pairwise Constraints ★
In this paper, an active learning method which can effectively select pairwise constraints during clustering procedure was presented. A novel semi-supervised text clustering algorithm was proposed, which employed an effective pairwise constraints selection method. As the samples on the fuzzy boundary are far away from the cluster center in the clustering procedure, they can be easily divided in...
متن کاملMultiple Pairwise Sequences Alignments with Needleman-Wunsch Algorithm on GPU
Pairwise sequence alignment is the method to find the best matching piece for two sequences. It can be either local which return the most similar subsequence or global which return the alignment of whole sequence. Nowadays, the number of genetic sequences increases exponentially so that it becomes a challenge to analyze and understand those data. The cutting-edge parallel architectures provide ...
متن کاملOn pairwise weakly Lindelof bitopological spaces
In the present paper we introduce and study the notion of pairwise weakly Lindelof bitopological spaces and obtain some results. Further, we also study the pairwise weakly Lindelof subspaces and subsets, and investigate some of their properties. It was proved that a pairwise weakly Lindelof property is not a hereditary property.
متن کاملPairwise Independent Key Generation Algorithm: A Survey
Key Generation is a technique to provide a secure and efficient generation of Key Pairs so that the keys can’t be attacked by the external or unauthorized users. Since there are various techniques implemented for the generation of keys such as based on Graphical Methods [1]. Here in this paper a review of all the existing techniques implemented for the generation of Key Pairs is analyzed and di...
متن کاملA Randomized Algorithm for Pairwise Clustering
We present a stochastic clustering algorithm based on pairwise similarity of datapoints. Our method extends existing deterministic methods, including agglomerative algorithms, min-cut graph algorithms, and connected components. Thus it provides a common framework for all these methods. Our graph-based method differs from existing stochastic methods which are based on analogy to physical systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1994
ISSN: 0021-8693
DOI: 10.1006/jabr.1994.1106